A Computationally Efficient Dynamic Grid Motion Approach for Arbitrary Lagrange–Euler Simulations

نویسندگان

چکیده

The present article addresses the topic of grid motion computation in Arbitrary Lagrange–Euler (ALE) simulations, where a fluid mesh must be updated to follow displacements Lagrangian boundaries. A widespread practice is deduce for internal nodes from parabolic equation, such as harmonic introducing an extra computational cost solver. An alternative strategy proposed minimize that by changing equation hyperbolic implementing additional time derivative term allowing explicit solution problem. fictitious dynamic problem thus obtained grid, with dedicated material parameters carefully chosen enhance efficiency and preserve quality accuracy physical solution. After reminding basics ALE expression Navier–Stokes equations describing problem, paper provides necessary characterization influence analysis robustness new approach compared reference on significant 2D test case. 3D case finally extensively studied terms performance highlight discuss benefits motion.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Computationally Efficient Model for Pedestrian Motion Prediction

We present a mathematical model to predict pedestrian motion over a finite horizon, intended for use in collision avoidance algorithms for autonomous driving. The model is based on a road map structure, and assumes a rational pedestrian behavior. We compare our model with the stateof-the art and discuss its accuracy, and limitations, both in simulations and in comparison to real data.

متن کامل

A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs

We propose a computationally efficient Fully Polynomial-Time Approximation Scheme(FPTAS) to compute an approximation with arbitrary precision of the value function of convexstochastic dynamic programs, using the technique of K-approximation sets and functions introducedby Halman et al. (2009). This paper deals with the convex case only, and it has the following con-tributions: F...

متن کامل

Computationally Efficient MR-FDPF Method for Multifrequency Simulations

In this report, we propose a modification of the multi-resolution frequency domain ParFlow (MR-FDPF) method that allows simulating radio propagation channels in a frequency range. The performance of the proposed MR-FDPF implementation has been analyzed based on different realistic propagation scenarios. Key-words: ParFlow, TLM, wave propagation, indoor radio propagation, channel simulation, mul...

متن کامل

LAGO: A Computationally Efficient Approach for Statistical Detection

We study a general class of statistical detection problems where the underlying objective is to detect items belonging to a rare class from a very large database. We propose a computationally efficient method to achieve this goal. Our method consists of two steps. In the first step we estimate the density function of the rare class alone with an adaptive bandwidth kernel density estimator. The ...

متن کامل

A Dynamic Approach for Honeypot Management

Honeypot is a security device the value of which lies mainly in discovering and inspecting, being attacked and being at risk. Most of the present Honeypots are configured and installed on the network statically. In some cases considerations have been made on dynamic configuration of Honeypots at the time of installation but still no study have been carried out on how to instantaneously change t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Fluids

سال: 2023

ISSN: ['2311-5521']

DOI: https://doi.org/10.3390/fluids8050156